A Note on the Arrow-Lind Theorem
نویسندگان
چکیده
Kenneth Arrow and Robert Lind have recently proved a theorem on risky public projects, stating that under certain conditions the social cost of the risk tends to zero as the population tends to infinity, so that projects can be evaluated on the basis of expected net benefit alone. The present note gives an alternative formulation and a short new proof of the theorem, and uses these to examine the role of certain assumptions concerning the operation of the public sector which in the original were left implicit or received inadequate attention. Some general critical comments on the applicability of the theorem are also offered. The conditions stated by Arrow and Lind as sufficient for the validity of their result include the following: (i) the government initially appropriates all benefits and pays all costs, distributing the net returns subsequently "through changes in the level of taxes" (p. 371); (ii) the net returns are statistically independent of each person's disposable income in the absence of the project; and (iii) each person's share of the net returns tends to zero as the number n of persons tends to infinity. The result is proved formally only for the case where "all taxpayers [are] identical in that they [have] the same utility function, their incomes [are] represented by identically distributed variables, and they [are] subject to the same tax rates"; but the authors state that " . . .the basic theorem still holds, provided that as n becomes larger the share of the public investment borne by any individual becomes arbitrarily smaller" (p. 373). This theorem, if generally applicable, would have important practical consequences. It would tend to support an extension of public sector investment by justifying the use of a riskless
منابع مشابه
A note on spectral mapping theorem
This paper aims to present the well-known spectral mapping theorem for multi-variable functions.
متن کاملA Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei
In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...
متن کاملArrow theorems in the fuzzy setting
Throughout this paper, our main idea is to analyze the Arrovian approach in a fuzzy context, paying attention to different extensions of the classical Arrow's model arising in mathematical Social Choice to aggregate preferences that the agents define on a set of alternatives. There is a wide set of extensions. Some of them give rise to an impossibility theorem as in the Arrovian classical mod...
متن کاملA Reconsideration of Arrow-Lind: Risk Aversion, Risk Sharing, and Agent Choice
We consider the original Arrow-Lind framework in which a government undertakes a risky project to be shared among many taxpayers. In our model, the taxpayers decide the level of participation in the risky project. Moreover, the amount of taxes collected by the government fully finances the public project. In this case, we show that projects cannot be evaluated only on the basis of expected bene...
متن کاملA Note on the Strong Law of Large Numbers
Petrov (1996) proved the connection between general moment conditions and the applicability of the strong law of large numbers to a sequence of pairwise independent and identically distributed random variables. This note examines this connection to a sequence of pairwise negative quadrant dependent (NQD) and identically distributed random variables. As a consequence of the main theorem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005